A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems

A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...

A Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems

The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case mess...

A Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems

In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie  cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the ...

A O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure

A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced. named “open-cube“ , has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good perfotmances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node fail...

A distributed fault-tolerant asynchronous algorithm for performing N tasks